convex programming problem meaning in Chinese
凸规划问题
凸性规划问题
Examples
- Convex programming problem
凸规划问题 - Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
最后，还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解。 - Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem
摘要首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题，然后通过利用这个单约束的规划问题，对原来的多约束规划问题提出了一些凸化、凹化的方法，这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划同题。